منابع مشابه
Constrained via minimization
We show that the general two layer constrained via minimization problem and the three layer constrained via minimization problem for HVH topologies are NP-hard. A backtracking and a heuristic algorithm for the three layer HVH constrained via minimization problem are proposed. The backtracking algorithm can also be used for three layer non HVH problems. Experimental results indicate that our heu...
متن کاملAn exact model for multi-layer constrained via minimization
In this paper we consider the multi-layer constrained via minimization problem which arises in the design of integrated circuits and printed circuit boards. That problem has been shown to be NP-complete even for two layers when the maximum junction degree is ≥ 4. We show that, for any maximum junction degree, for a given k, k ≥ 2, the problem can be reduced to the k-partite induced subgraph pro...
متن کاملCartoon-like image reconstruction via constrained ℓp-minimization
This paper considers the problem of reconstructing images from only a few measurements. A method is proposed that is based on the theory of Compressive Sensing. We introduce a new prior that combines an `p-pseudo-norm approximation of the image gradient and the bounded range of the original signal. Ultimately, this leads to a reconstruction algorithm that works particularly well for Cartoon-lik...
متن کاملGroup-Wise Cortical Correspondence via Sulcal Curve-Constrained Entropy Minimization
We present a novel cortical correspondence method employing group-wise registration in a spherical parametrization space for the use in local cortical thickness analysis in human and non-human primate neuroimaging studies. The proposed method is unbiased registration that estimates a continuous smooth deformation field into an unbiased average space via sulcal curve-constrained entropy minimiza...
متن کاملConstrained convex minimization via model-based excessive gap
We introduce a model-based excessive gap technique to analyze first-order primaldual methods for constrained convex minimization. As a result, we construct new primal-dual methods with optimal convergence rates on the objective residual and the primal feasibility gap of their iterates separately. Through a dual smoothing and prox-function selection strategy, our framework subsumes the augmented...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1993
ISSN: 0278-0070
DOI: 10.1109/43.205007